Bisimilarity of One-Counter Processes Is PSPACE-Complete
نویسندگان
چکیده
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (with no ε-steps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches the known PSPACE lower bound (Srba 2009). We add the PTIME-completeness result for deciding regularity (i.e. finiteness up to bisimilarity) of one-counter processes.
منابع مشابه
Complexity of Checking Bisimilarity between Sequential and Parallel Processes
Decidability of bisimilarity for Process Algebra (PA) processes, arising by mixing sequential and parallel composition, is a longstanding open problem. The known results for subclasses contain the decidability of bisimilarity between basic sequential (i.e. BPA) processes and basic parallel processes (BPP). Here we revisit this subcase and derive an exponential-time upper bound. Moreover, we sho...
متن کاملSome problems related to bisimilarity on BPP
Jančar has in 2003 shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. Bisimilarity is studied on various subclasses of BPP as well. We present summary of known complexity bounds of some such bisimilarity problems. Moreover is here shown that deciding regularity of a BPP is PSPACE-complete. So far this problem was only known to be PSPACE-hard.
متن کاملBisimilarity of Probabilistic Pushdown Automata
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without ε-transitions). Our first contribution is a general construction that reduces checking bisimilarity of probabilistic transition systems to checking bi...
متن کاملRegularity of BPP is PSPACE-complete
Jančar has in 2003 shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. But bisimilarity is studied also on various subclasses of BPP. We present summary of known complexity bounds of some such bisimilarity problems. Moreover is here shown that deciding regularity of a BPP is PSPACE-complete. This result was presented at winter school Movep’04 in PhD stu...
متن کاملOn distributed bisimilarity over Basic Parallel Processes 1
Distributed bisimilarity is one of non-interleaving equivalences studied on concurrent systems; it refines the classical bisimilarity by taking also the spatial distribution of (sub)components into account. In the area of verification of infinite-state systems, one of the simplest (most basic) classes is the class of Basic Parallel Processes (BPP); here distributed bisimilarity is known to coin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010